Set-membership observer design based on ellipsoidal invariant sets
نویسندگان
چکیده
منابع مشابه
On invariant sets topology
In this paper, we introduce and study a new topology related to a self mapping on a nonempty set.Let X be a nonempty set and let f be a self mapping on X. Then the set of all invariant subsets ofX related to f, i.e. f := fA X : f(A) Ag P(X) is a topology on X. Among other things,we nd the smallest open sets contains a point x 2 X. Moreover, we find the relations between fand To f . For insta...
متن کاملDetermination of Set-Membership Identifiability Sets
This paper concerns the concept of set-membership identifiability introduced in [4]. Given a model, a set-membership identifiable set is a connected set in the parameter domain of the model such that its corresponding trajectories are distinct to trajectories arising from its complementary. For obtaining the so-called set-membership identifiable sets, we propose an algorithm based on interval a...
متن کاملOn Membership Comparable Sets
A set A is k(n) membership comparable if there is a polynomial time computable function that, given k(n) instances of A of length at most n, excludes one of the 2 k(n) possibilities for the memberships of the given strings in A. We show that if SAT is O(log n) membership comparable, then UniqueSAT 2 P. This extends the and answers in the aarmative an open question suggested by Buhrman, Fortnow,...
متن کاملEllipsoidal Approximations of Convex Sets Based on the Volumetric Barrier
Let C R n be a convex set. We assume that kxk 1 1 for all x 2 C, and that C contains a ball of radius 1=R. For x 2 R n , r 2 R, and B an n n symmetric positive deenite matrix, let E(x; B; r) = fy j (y ? x) T B(y ? x) r 2 g. A-rounding of C is an ellipsoid E(x; B; r) such that E(x; B; r==) C E(x; B; r). In the case that C is characterized by a separation oracle, it is well known that an O(n 3=2)...
متن کاملSOLUTION-SET INVARIANT MATRICES AND VECTORS IN FUZZY RELATION INEQUALITIES BASED ON MAX-AGGREGATION FUNCTION COMPOSITION
Fuzzy relation inequalities based on max-F composition are discussed, where F is a binary aggregation on [0,1]. For a fixed fuzzy relation inequalities system $ A circ^{F}textbf{x}leqtextbf{b}$, we characterize all matrices $ A^{'} $ For which the solution set of the system $ A^{' } circ^{F}textbf{x}leqtextbf{b}$ is the same as the original solution set. Similarly, for a fixed matrix $ A $, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2017
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2017.08.1043